Patternmatching Image Compressionwith Predication

نویسندگان

  • Denis Arnaud
  • Wojciech Szpankowski
چکیده

Recently, a novel image compression technique based on pattern matching was proposed, namely Pattern Matching Image Compression (PMIC). Basically, it is a lossy extension of the well known Lempel-Ziv scheme. It was proved that such an extension leads to a suboptimal compression, and that the compression ratio can as low as the so called R enyi entropy. Success of PMIC crucially depends on several enhancements such as searching for reverse approximate matching, recognizing substrings in images that are additively shifted versions of each other, introducing a variable and adaptive maximum distortion level, and so forth. In this paper, we introduce another enhancement, namely, predictive coding. More importantly, we implement Diierential Predictive Code Modulation (DPCM) within PMIC scheme. We report here some preliminary experimental results which show that PMIC enhanced by prediction can improve compression ratio for good quality images as well as speed of compression for PMIC.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Distance Measure for Video Sequences

Video is a unique multimedia data type, in that it comes with distinguished spatio-temporal constraints. Content-based video retrieval thus requires methods for video sequence-to-sequence matching, incorporating the temporal ordering inherent in a video sequence, without losing sight of the visual nature of the information in the sequence. Such methods will require reliable measures of similari...

متن کامل

Dataflow Predication Aaron

Predication facilitates high-bandwidth fetch and large static scheduling regions, but has typically been too complex to implement comprehensively in out-of-order microarchitectures. This paper describes dataflow predication, which provides per-instruction predication in a dataflow ISA, low predication computation overheads similar to VLIW ISAs, and low complexity out-of-order issue. A twobit fi...

متن کامل

Web Services Evaluation Predication Model based on Time Utility

Current predication models fail to consider the time utility of the web services evaluation predication and treat the different historical ratings in the same way. To solve this problem, we put forward web service evaluation predication model based on time utility. In the model, naïve quantification method and complex quantification method are proposed to achieve the distinct and proper time ut...

متن کامل

The Modular Community Structure of Linguistic Predication Networks

This paper examines the structure of linguistic predications in English text. Identified by the copular “is-a” form, predications assert category membership (hypernymy) or equivalence (synonymy) between two words. Because predication expresses ontological structure, we hypothesize that networks of predications will form modular groups. To measure this, we introduce a semantically motivated meas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996